MIMO communication method and system using the block circulant jacket matrices

ABSTRACT

Provided herein is a fast block circulant generated Hadamard matrix which is called jacket matrices of orders N=2p,4p,4 k p,np, wherein k is a positive integer. The block Toeplitz circulant jacket matrices possess many properties of Walsh-Hadamard Toeplitz transform and also have the construction of block circulant, which can be applied to fast algorithms for decomposition easily. The matrix decomposition is of the form of the products of block identity I 2  matrix and block Hadamard H 2  matrix. The block Toeplitz circulant jacket matrices can be applied to the Kronecker MIMO channel.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority from Korean Patent Application No. 10-2015-0038319 filed in the Korean Intellectual Property Office on Mar. 19, 2015, the disclosure of which is incorporated herein by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

Methods and apparatuses consistent with the exemplary embodiments relate to MIMO (Multi-Input Multi-Output) communication, and more particularly, to an MIMO communication method and system that use a plurality of transmit antennas and a plurality of receive antennas.

2. Description of the Prior Art

Discrete orthogonal transforms, such as Walsh-Hadamard transform (WHT), discrete Fourier transform (DFT) play a key important role in digital signal and image processing applications, since orthogonal transforms can often decorrelate the components of a given signal and redistribute the energy contained in the signal so that most of energy is contained in a small number of components. For example, the Walsh-Hadamard transform(WHT) has been widespreadly using in signal processing, image processing, error-correcting codes, and orthogonal design, because of fast computational algorithm is very simplicity, i.e. +1,−1. Researches have made a considerable amount of effort to develop various kind of discrete orthogonal transforms. Since the orthogonal transform with the independent parameters can carry many different characterisation of digital signals, it is interesting to investigate the possibility of generalization of WHT which is the Jacket transform. Generalized, the Jacket matrices idea is from center weighted Hadamard matrices.

The transforms with special structure are desirable. Although there exist circulant Hadamard matrices of order 1 and order 4, one conjectures that there do not exist any circulant Hadamard matrices of order at least 5. Thus, there is a need to develop a method for construction of block Toeplitz circulant Jacket transform of or above order 5, and a way to apply the method to MIMO communciation.

SUMMARY OF THE INVENTION

Therefore, a purpose of various embodiments of the present disclosure is to resolve the aforementioned problems, that is, to provide a method for estimating an MIMO channel using a block circulant jacket matrix of or above order 5, and a system where the method is applied.

According to an embodiment of the present disclosure, there is provided an MIMO communication method, including receiving a transmit signal; and estimating a channel using a receive signal, wherein the estimating estimates the channel using formula:

$Y = {{\sqrt{\frac{E_{x}}{N_{T}}}{HX}} + Z}$ Y being the receive signal, E_(x) being an energy of the transmit signal, N_(T) being a number of transmit antennas, X being the transmit signal, Z being noise, and H being a channel matrix comprising a BCJM (Block Circulant Jacket Matrix) of order n (>4).

The H may be expressed by formula: H=R_(r) ^(1/2)H_(w)R_(t) ^(1/2),R_(r) ^(1/2) being a matrix where correlation between transmit antennas are reflected, H_(w) being a channel gain matrix, and R_(t) ^(1/2) being a matrix where a correlation between receive antennas are reflected.

The R_(t) may be expressed by the BCJM.

The BCJM may be [C]_(np) in

$\lbrack C\rbrack_{np} = \begin{pmatrix} C_{0} & C_{1} & C_{2} & C_{3} & \ldots & C_{n - 2} & C_{n - 1} \\ C_{n - 1} & C_{0} & C_{1} & C_{2} & \ldots & C_{n - 3} & C_{n - 2} \\ \ldots & \ldots & \ldots & \ldots & \ddots & \ldots & \ldots \\ C_{1} & C_{2} & C_{3} & C_{4} & \ldots & C_{n - 1} & C_{0} \end{pmatrix}$ C₀, . . . , C_(n−1) being a p×p packet matrix.

The BCJM may be a block circulant jacket matrix [C]_(4p) of order 4p of

$\lbrack C\rbrack_{4p} = \begin{pmatrix} C_{0} & C_{1} & C_{2} & C_{3} \\ C_{3} & C_{0} & C_{1} & C_{2} \\ C_{2} & C_{3} & C_{0} & C_{1} \\ C_{1} & C_{2} & C_{3} & C_{0} \end{pmatrix}$ C_(i)(i=0,1,2,3) being a p×p packet matrix.

According to an embodiment of the present disclosure, there is provided an MIMO communication apparatus including N_(R) receive antennas for receiving a transmit signal from a transmit end; and a receive end for estimating a channel using the receive signal received through the receive antennas, wherein the receive end estimates the channel using formula:

$Y = {{\sqrt{\frac{E_{x}}{N_{T}}}{HX}} + Z}$ Y being the receive signal, Ex being an energy of the transmit signal, NT being a number of transmit antennas, X being the transmit signal, Z being noise, and H being a channel matrix comprising a BCJM (Block Circulant Jacket Matrix) of order n (>4).

As aforementioned, according to various embodiments of the present disclosure, it is possible to estimate a channel by fast computation using block circulant Jacket matrices, thereby improving the speed of estimating a channel, and improving an MIMO channel capacity.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and/or other aspects of the present disclosure will be more apparent by describing certain present disclosure with reference to the accompanying drawings, in which:

FIG. 1 illustrates a one-dimensional cellular system consisting of two base stations and four symmetrically disposed user groups;

FIG. 2 illustrates a 2×2 spatial correlated MIMO channel;

FIG. 3 illustrates a fast orthogonal BCJM transform signal flow graph for a forward, N=8;

FIG. 4 illustrates a fast orthogonal BCJM transform signal flow graph for an inverse, N=8;

FIG. 5 illustrates a BCJM encoding block;

FIG. 6 illustrates a system model of MIMO Gaussian Channel;

FIG. 7 illustrates a table for comparison of BCJM complexity between a conventional method and an embodiment of the present disclosure;

FIG. 8 illustrates a channel capacity versus SNR;

FIG. 9 illustrates a comparison of 4×4 MIMO and Block Diagonal 4×4 MIMO Symbol Error Rate; and

FIG. 10 illustrates CDFs of the correlated 2×2 and 4×4 MIMO channel.

DETAILED DESCRIPTION

Certain exemplary embodiments are described in higher detail below with reference to the accompanying drawings.

In the following description, like drawing reference numerals are used for the like elements, even in different drawings. The matters defined in the description, such as detailed construction and elements, are provided to assist in a comprehensive understanding of exemplary embodiments. However, exemplary embodiments can be practiced without those specifically defined matters. Also, well-known functions or constructions are not described in detail since they would obscure the application with unnecessary detail.

Hereinafter, the present disclosure will be explained in more detail with reference to the figures.

An embodiment of the present disclosure presents a fast block circulant generated Hadamard which is called jacket matrices of orders N=2p,4p,4^(k)p,np, wherein k is a positive integer.

The class of block Toeplitz circulant Jacket matrices not only possess many properties of Walsh-Hadamard Toeplitz transform but also have the construction of block circulant, which can be applied to fast algorithms for decomposition easily. The matrix decomposition is of the form of the products of block identity I₂ matrix and block Hadamard H₂ matrix.

In the embodiment of the present disclosure, the block Toeplitz circulant Jacket transform can be applied to the Kronecker MIMO channel.

Definition 1.1: Let A=(a_(jk)) be an n×n matrix whose elements are in a field F (including real fields, complex fields, finite fields, etc.). Denote by A^(†) as the transpose matrix of the element-wise inverse of A, that is, A⁵⁵⁴ =(a_(jk) ⁻¹). Then A is called a Jacket matrix if AA^(†)=A^(†)A=nI_(n), where I_(n) is the identity matrix over the field F. Then, we can easily calculate the inverse of large matrices.

For example, given a matrix, A, and its element-wise inverse transpose, A^(†), as

$\begin{matrix} {{A = \begin{pmatrix} a & \sqrt{ac} \\ \sqrt{ac} & {- c} \end{pmatrix}},{A^{\dagger} = \begin{pmatrix} \frac{1}{a} & \frac{1}{\sqrt{ac}} \\ \frac{1}{\sqrt{ac}} & {- \frac{1}{c}} \end{pmatrix}},} & (1) \end{matrix}$

We say A is a 2×2 Jacket matrix. As a special case, when a=c=1, then a 2×2 Hadamard matrix.

Definition 1.2: Let A be an n×n matrix. If there exists a Jacket matrix J such that A=JDJ⁻¹, where D is a diagonal matrix, then we say that A is Jacket similar to the diagonal matrix D. We say that A is Jacket diagonalisable.

Definition 1.3: Let

$\lbrack C\rbrack_{N} = \begin{pmatrix} C_{0} & C_{1} \\ C_{1} & C_{0} \end{pmatrix}$ be 2×2 block matrix of order N=2p. If [C₀]_(p) and [C₁]_(p)are p×p Jacket matrices, then [C]_(N) is block circulant Jacket matrix if and only if C₀C₁ ^(RT)+C₁ ^(RT)C₀=[0]_(N), where RT is reciprocal transpose.

On the while, let X_(n) be a discrete time random process with expectation E(X_(i))=m_(i) and covariance function Cov(X_(i),X_(j))=E((X_(i))−m_(i))(X_(j))−m_(j)). One of the interesting progress is that m_(i) is constant which is not dependent on i and K_(n)=[Cov(X_(i),X_(j));i,j=1, . . . , n] is Toeplitz matrix. This result deals with the asymptotic behavior of the eigenvalues of an n×n Hermitian Toeplitz matrix T_(n)=(t_(j−k))_(j,k=1) ^(n), where the complex numbers t_(k) with k∈Z are the Fourier coefficients of a bounded function called the symbol of the sequence T_(n). This progress is called weakly stationary, which has many application in signal processing theory. There is a common special case circulant matrix of Toeplitz matrices, which plays a fundamental role in developing more general results. However, there are random progress whose covariance matrix is not circulant matrix, but is block circulant matrix. With the result of the above results, we are able to analysis the behavior of the eigenvalues and the other properties.

Therefore, If A is Jacket similar to the diagonal matrix D, then the main diagonal entries of D are all eigenvalues. Furthermore, since A=JDJ⁻¹, we have D=J⁻¹AJ. Note that since J is a Jacket matrix, its inverse is easy to obtain, that is,

$J_{n \times n}^{- 1} = {\frac{J_{n \times n}^{\dagger}}{n}.}$

Hence we can directly calculate the eigenvalues of A by

$D = {\frac{J^{\dagger}{AJ}}{n}.}$ In the present embodiment, a class of matrices that may have eigenvalue decomposition (EVD) through Jacket matrices are dealt with. Then it is applied to precoding and decoding of distributive-MIMO channels in wireless communications.

An N×N matrix [C]_(N) is said to be a block circulant matrix if it has the following form:

$\begin{matrix} {{A = \begin{pmatrix} C_{0} & C_{1} & C_{2} & \ldots & C_{n - 2} & C_{n - 1} \\ C_{n - 1} & C_{0} & C_{1} & \ldots & C_{n - 3} & C_{n - 2} \\ C_{n - 2} & C_{n - 1} & C_{0} & \ldots & C_{n - 4} & C_{n - 3} \\ \ldots & \ldots & \ldots & \ddots & \ldots & \ldots \\ C_{2} & C_{3} & C_{4} & \ldots & C_{0} & C_{1} \\ C_{1} & C_{2} & C_{3} & \ldots & C_{n - 1} & C_{0} \end{pmatrix}},} & (2) \end{matrix}$ where N=np and the C_(i) are p×p submatrices (block) of complex or real-valued elements for i=0, . . . , n−1. Hence an N×N matrix [C]_(N)=(C_(jk)) is an block circulant matrix with p×p blocks C_(j) ₁ _(,k) ₁ =C_(j) ₂ _(,k) ₂ , whenever (j₁−k₁)−(j₂−k₂)=0, or n or −n. When p=1, the matrix is simply an N×N circulant matrix.

For an N×N matrix [J]_(N), the N×N associated matrix matrix [J]_(N) ^(RT) is obtained from matrix [J]_(N) by taking the reciprocal of each entry of and exchanging its row and column indices. In other words, the (k,i) entry of [J]_(N) ^(RT) is equal to the reciprocal of the element in the (i,k) position in [J]_(N). The jacket matrices are mutually orthogonal.

Definition 2.1: An N×N complex matrix [J]_(N)=(j_(i,k)) is called a Jacket matrix, if [J]_(N) is invertible and the element in the entries (i,k) of its inverse matrix is equal to product of 1/N and the inverse of the element in the entries (k,i) of [J]_(N). In other words, if

$\begin{matrix} {{{\lbrack J\rbrack_{N} = \begin{pmatrix} j_{0,0} & j_{0,1} & \ldots & j_{0,{N - 1}} \\ j_{1,0} & j_{1.1} & \ldots & j_{1,{N - 1}} \\ \ldots & \ldots & \ldots & \ldots \\ j_{{N - 1},0} & j_{{N - 1},1} & \ldots & j_{{N - 1},{N - 1}} \end{pmatrix}},{and},}\;} & (3) \\ {\lbrack J\rbrack_{N}^{- 1} = {{\frac{1}{N}\lbrack J\rbrack}^{RT} = {\begin{pmatrix} \frac{1}{j_{0,0}} & \frac{1}{j_{1,0}} & \ldots & \frac{1}{j_{{N - 1},0}} \\ \frac{1}{j_{0,1}} & \frac{1}{j_{1,1}} & \ldots & \frac{1}{j_{{N - 1},1}} \\ \ldots & \ldots & \ldots & \ldots \\ \frac{1}{j_{0,{N - 1}}} & \frac{1}{j_{1,{N - 1}}} & \ldots & \frac{1}{j_{{N - 1},{N - 1}}} \end{pmatrix}.}}} & (4) \end{matrix}$

An N×N matrix [C]_(N)=(C_(jk) with blocks p×p and N=np is called BCJM (block circulant Jacket matrix) if it is also Jacket matrix. In particular, whenever p=1, the block circulant Jacket matrices are just circulant Jacket matrices.

For example, the well-known Hadamard matrices are Jacket matrices family.

The 2×2 Jacket matrix is as follows:

$\begin{matrix} {{\lbrack H\rbrack_{2} = \begin{pmatrix} 1 & 1 \\ 1 & {- 1} \end{pmatrix}},} & (5) \end{matrix}$ is both the Hadamard matrix and Jacket matrix. But it is not circulant matrix. Hence [H]₂ is not circulant Jacket matrix. In fact, up to now, the only known circulant Hadamard matrices are [H]₁=(1) and [H]₄:

$\begin{matrix} \begin{matrix} {\lbrack H\rbrack_{4} = {\begin{pmatrix} 1 & 1 & 1 & 1 \\ 1 & 1 & 1 & 1 \\ 1 & 1 & 1 & 1 \\ 1 & 1 & 1 & 1 \end{pmatrix} - {2\begin{pmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{pmatrix}}}} \\ {= {\left. \begin{pmatrix} {- 1} & 1 & 1 & 1 \\ 1 & {- 1} & 1 & 1 \\ 1 & 1 & {- 1} & 1 \\ 1 & 1 & 1 & {- 1} \end{pmatrix}\Longrightarrow\begin{pmatrix} C_{0} & C_{1} \\ C_{1} & C_{0} \end{pmatrix} \right..}} \end{matrix} & (6) \end{matrix}$

It is conjectured that there do not exist other circulant Hadamard matrices. The concept of modular Hadamard matrices resurfaced in the engineering literature recently during the course of the investigation of Jacket matrices. But it will be different for conventional Jacket matrices. For example,

$\begin{matrix} {{\lbrack J\rbrack_{2} = \begin{pmatrix} a & {ai} \\ {ai} & a \end{pmatrix}},} & (7) \end{matrix}$ for all any nonzero complex number a is a circulant Jacket matrix. Let ω be complex 3-th roots of unity, i.e., ω³=1 and ω≠1. Then

$\begin{matrix} {{\lbrack J\rbrack_{3} = \begin{pmatrix} 1 & \omega & 1 \\ 1 & 1 & \omega \\ \omega & 1 & 1 \end{pmatrix}},} & (8) \end{matrix}$ is also circulant Jacket matrix of order 3. There are only two types circulant Jacket matrices of order 4.

Definition 2.2: Let [J]₄ be a circulant Jacket matrix. Then

$\begin{matrix} {\lbrack J\rbrack_{4} = {\begin{pmatrix} a_{0} & a_{1} & a_{0} & {- a_{1}} \\ {- a_{1}} & a_{0} & a_{1} & a_{0} \\ a_{0} & {- a_{1}} & a_{0} & a_{1} \\ a_{1} & a_{0} & {- a_{1}} & a_{0} \end{pmatrix}.\mspace{14mu}{and}}} & (9) \\ {\lbrack J\rbrack_{4} = {\begin{pmatrix} a_{0} & a_{1} & {- a_{0}} & a_{1} \\ a_{1} & a_{0} & a_{1} & {- a_{0}} \\ {- a_{0}} & {- a_{1}} & a_{0} & a_{1} \\ a_{1} & {- a_{0}} & {- a_{1}} & a_{0} \end{pmatrix}.}} & (10) \end{matrix}$

Proof. Since [J]₄ is circulant matrix of order 4, let

$\lbrack J\rbrack_{4} = {\begin{pmatrix} a_{0} & a_{1} & a_{2} & a_{3} \\ a_{3} & a_{0} & a_{1} & a_{2} \\ a_{2} & a_{3} & a_{0} & a_{1} \\ a_{1} & a_{2} & a_{3} & a_{0} \end{pmatrix}.}$ be Jacket matrix of order 4. Hence by the definition of Jacket matrix, we have

$\begin{matrix} {{{\frac{a_{0}}{a_{3}} + \frac{a_{1}}{a_{0}} + \frac{a_{2}}{a_{1}} + \frac{a_{3}}{a_{2}}} = 0},} & (11) \\ {{{\frac{a_{0}}{a_{2}} + \frac{a_{1}}{a_{3}} + \frac{a_{2}}{a_{0}} + \frac{a_{3}}{a_{1}}} = 0},} & (12) \\ {{\frac{a_{0}}{a_{1}} + \frac{a_{1}}{a_{2}} + \frac{a_{2}}{a_{3}} + \frac{a_{3}}{a_{0}}} = 0.} & (13) \end{matrix}$

Then equations (11) and (13) implies that

$\begin{matrix} {{\left( {\frac{a_{0}}{a_{3}} + \frac{a_{1}}{a_{0}} + \frac{a_{2}}{a_{1}}} \right)\left( {\frac{a_{0}}{a_{1}} + \frac{a_{1}}{a_{2}} + \frac{a_{3}}{a_{0}}} \right)} = {\left( {- \frac{a_{3}}{a_{2}}} \right){\left( {- \frac{a_{2}}{a_{3}}} \right).}}} & (14) \end{matrix}$

By rearranging equation (14), we have

$\begin{matrix} {{\left( {1 + \frac{a_{0}a_{1}}{a_{2}a_{3}}} \right)\left( {1 + \frac{a_{1}a_{3}}{a_{0}^{2}}} \right)\left( {1 + \frac{a_{0}a_{2}}{a_{1}^{2}}} \right)} = 0.} & (15) \end{matrix}$

By (15), we consider the following three cases.

Case 1:

${{1 + \frac{a_{1}a_{3}}{a_{0}^{2}}} = 0},$ i.e.,

$a_{3} = {- {\frac{a_{0}^{2}}{a_{1}}.}}$ Substituting a₃ in (11) yields

${\frac{a_{0}a_{1}}{- a_{0}^{2}} + \frac{a_{1}}{a_{0}} + \frac{a_{2}}{a_{1}} + \frac{- a_{0}^{2}}{a_{1}a_{2}}} = 0.$

Thus a₂=±a₀.

If a₂=a₀, substituting a₃ and a₂ in (12) yields a₁=±a₀. Therefore,

$\begin{matrix} {{\lbrack J\rbrack_{4} = \begin{pmatrix} a_{0} & {\pm a_{0}} & a_{0} & {\mp a_{0}} \\ {\mp a_{0}} & a_{0} & {\pm a_{0}} & a_{0} \\ a_{0} & {\mp a_{0}} & a_{0} & {\pm a_{0}} \\ {\pm a_{0}} & a_{0} & {\mp a_{0}} & a_{0} \end{pmatrix}},} & (16) \end{matrix}$ for all nonzero complex number a₀.

If a₂=−a₀, substituting a₃ and a₂ in (12) yields a₁=±a₀i, where I²=1. Therefore,

$\begin{matrix} {\lbrack J\rbrack_{4} = {\begin{pmatrix} a_{0} & {{\pm a_{0}}i} & a_{0} & {{\mp a_{0}}i} \\ {{\mp a_{0}}i} & a_{0} & {{\pm a_{0}}i} & a_{0} \\ a_{2} & {{\mp a_{0}}i} & a_{0} & {{\pm a_{0}}i} \\ {{\pm a_{0}}i} & a_{0} & {{\mp a_{0}}i} & a_{0} \end{pmatrix}.}} & (17) \end{matrix}$

Case 2:

${{1 + \frac{a_{0}a_{2}}{a_{1}^{2}}} = 0},$ i.e.,

$a_{2} = {- {\frac{a_{1}^{2}}{a_{0}}.}}$ Substituting a₂ in equation (11) yields

${\frac{a_{0}}{a_{3}} + \frac{a_{1}}{a_{0}} + \frac{- a_{1}^{2}}{a_{0}a_{1}} + \frac{a_{3}a_{0}}{- a_{2}^{2}}} = 0.$

So a₃=±a₁.

If a₃=a₁, substituting a₃ and a₂ in equation (12) yields that a₁=±a₀, which implies a₂=−a₀ and a₃=±a₀. So

$\begin{matrix} {\lbrack J\rbrack_{4} = {\begin{pmatrix} a_{0} & {\pm a_{0}} & {- a_{0}} & {\pm a_{0}} \\ {\pm a_{0}} & a_{0} & {\pm a_{0}} & {- a_{0}} \\ {- a_{0}} & {\pm a_{0}} & a_{0} & {\pm a_{0}} \\ {\pm a_{0}} & {- a_{0}} & {\pm a_{0}} & a_{0} \end{pmatrix}.}} & (18) \end{matrix}$

If a₃=−a₁, substituting a₂,a₃ in equation (12) yields

${\frac{a_{0}^{2}}{- a_{1}^{2}} + \frac{a_{1}}{- a_{1}} + \frac{- a_{1}^{2}}{a_{0}^{2}} + \frac{- a_{1}}{a_{1}}} = 0.$

Hence a₁=±a₀i,a₂=a₀ and a₃=∓a₀i. Therefore

$\begin{matrix} {\lbrack J\rbrack_{4} = {\begin{pmatrix} a_{0} & {{\pm a_{0}}i} & a_{0} & {{\mp a_{0}}i} \\ {{\mp a_{0}}i} & a_{0} & {{\pm a_{0}}i} & a_{0} \\ a_{0} & {{\mp a_{0}}i} & a_{0} & {{\pm a_{0}}i} \\ {{\pm a_{0}}i} & a_{0} & {{\mp a_{0}}i} & a_{0} \end{pmatrix}.}} & (19) \end{matrix}$

Case 3:

${{1 + \frac{a_{0}a_{1}}{a_{2}a_{3}}} = 0},$ i.e,

$a_{3} = {\frac{{{- a_{0}}a} - 1}{a_{2}}.}$ substituting a₃ in equation (11) yields

${\frac{a_{0}a_{2}}{{- a_{0}}a_{1}} + \frac{a_{1}}{a_{0}} + \frac{a_{2}}{a_{0}} + \frac{{- a_{0}}a_{1}}{a_{2}^{2}}} = 0.$

So a₂=±a₀. Then a₃=∓a₁. Therefore

$\begin{matrix} {\lbrack J\rbrack_{4} = {\begin{pmatrix} a_{0} & a_{1} & {\pm a_{0}} & {\mp a_{1}} \\ {\mp a_{1}} & a_{0} & a_{1} & {\pm a_{0}} \\ {\pm a_{0}} & {\mp a_{1}} & a_{0} & a_{1} \\ a_{1} & {\pm a_{0}} & {\mp a_{1}} & a_{0} \end{pmatrix}.}} & (20) \end{matrix}$

Block Circulant Jacket Matrices of Orders 2p,4p,4^(k)p,np

Hereinafter, some block Jacket matrices are presented.

A. Block Circulant Jacket Matrices of Order 2p

Definition 3.1: Let

$\lbrack C\rbrack_{N} = \begin{pmatrix} C_{0} & C_{1} \\ C_{1} & C_{0} \end{pmatrix}$ be 2×2 block matrix of order N=2p. If [C₀]_(p) and [C₁]_(p) are p×p Jacket matrices, then [C]_(N) is a Jacket matrix if and only if C ₀ C ₁ ^(RT) +C ₁ ^(RT) C ₀=[0]_(N),  (21) where RT is reciprocal transpose.

Proof. Since C₀ and C₁ are Jacket matrices, we have C₀C₀ ^(RT)=p[I]_(p) and C₁C₁ ^(RT)=p[I]_(p). Note that [C]_(N) is Jacket matrix if and only if [C][C]^(RT)=NI_(N). Then C is Jacket matrix if and only if

${\lbrack C\rbrack\lbrack C\rbrack}^{R\; T} = {{\begin{pmatrix} C_{0} & C_{1} \\ C_{1} & C_{0} \end{pmatrix}\begin{pmatrix} C_{0} & C_{1} \\ C_{1} & C_{0} \end{pmatrix}^{R\; T}} = {\begin{pmatrix} {2{p\lbrack l\rbrack}_{p}} & {{C_{0}C_{1}^{R\; T}} + {C_{1}^{R\; T}C_{0}}} \\ {{C_{0}C_{1}^{R\; T}} + {C_{1}^{R\; T}C_{0}}} & {2{p\lbrack l\rbrack}_{p}} \end{pmatrix} = {{N\lbrack l\rbrack}_{N}.}}}$

Hence [C]_(N) is a Jacket matrix if and only if C ₀ C ₁ ^(RT+C) ₁ ^(RT) C ₀=[0]_(N).

By using Definition 3.1, we may construct many block ciculant Jacket matrices.

Example 1. Let

${C_{0} = \begin{pmatrix} 1 & 1 \\ 1 & {- 1} \end{pmatrix}},{C_{1} = {\begin{pmatrix} a & {- a} \\ {- \frac{1}{a}} & {- \frac{1}{a}} \end{pmatrix}.}}$

Since C₀C₀ ^(RT)=2[I]₂ and C₁C₁ ^(RT)=2[I]₂, C₀ and C₁ are Jacket matrices of order 2. Moreover,

${{C_{0}C_{1}^{R\; T}} + {C_{1}^{R\; T}C_{0}}} = {{{\begin{pmatrix} 1 & 1 \\ 1 & {- 1} \end{pmatrix}\begin{pmatrix} {- \frac{1}{a}} & {- a} \\ {- \frac{1}{a}} & {- a} \end{pmatrix}} + {\begin{pmatrix} a & {- a} \\ {- \frac{1}{a}} & {- \frac{1}{a}} \end{pmatrix}\begin{pmatrix} 1 & 1 \\ 1 & {- 1} \end{pmatrix}}} = {\lbrack 0\rbrack_{2}.}}$

Hence a circulant matrix

$C = {\begin{pmatrix} C_{0} & C_{1} \\ C_{1} & C_{0} \end{pmatrix} = {\begin{pmatrix} 1 & 1 & a & {- a} \\ 1 & {- 1} & {- \frac{1}{a}} & {- \frac{1}{a}} \\ a & {- a} & 1 & 1 \\ {- \frac{1}{a}} & {- \frac{1}{a}} & 1 & {- 1} \end{pmatrix} = {\begin{pmatrix} 1 & 1 & 1 & {- 1} \\ 1 & {- 1} & {- 1} & {- 1} \\ 1 & {- 1} & 1 & 1 \\ {- 1} & {- 1} & 1 & {- 1} \end{pmatrix}_{a = 1}.}}}$ is a block circulant Jacket matrix. C_(o) is applied to MIMO 2×2 spatial correlation channel.

Circulant submatrices of size 2×2, i.e., such that each submatrix has the property that all rows are cyclic shifts of the first row and all columns are cyclic shifts of the first column as shown in FIG. 5. We shall refer to these submatrices as circulant blocks. Also, we define users equivalence classes as the sets of user groups whose corresponding columns of Hadamard form circulant blocks. FIG. 1 shows a one-dimensional cellular system comprising two base stations and four symmetrically located user groups. FIG. 2 shows the 2×2 spatial correlated MIMO channel. Herein, μ and ρ re Tx-Rx correlations, 2{circle around (×)}2 is given as spatial correlations matrix calculation.

When this symmetry condition holds, users in the same equivalence class are statistically equivalent, up to renumbering of the base stations.

A circulant matrix is fully specified by one vector which appears as the first column. Circulant matrices are important because they are digitalization by the DFT, and hence linear equations that contain them can be quickly solved using the fast Fourier transform (FFT) or orthogonal transform.

B. Block Circulant Jacket Matrices of Order 4p

Hereinafter, a novel class of block circulant Jacket matrices of order 4p will be presented.

Definition 3.2: Let

$\lbrack C\rbrack_{4\; p} = \begin{pmatrix} C_{0} & C_{1} & C_{2} & C_{3} \\ C_{3} & C_{0} & C_{1} & C_{2} \\ C_{2} & C_{3} & C_{0} & C_{1} \\ C_{1} & C_{2} & C_{3} & C_{0} \end{pmatrix}$ be a block circulant matrix of order 4p. If C_(i) is a p×p Jacket matrix for i=0,1,2,3 then [C]_(4p) is Jacket matrix if and only if the following condition holds. C ₀ C ₃ ^(RT) +C ₁ C ₀ ^(RT) +C ₂ C ₁ ^(RT) +C ₃ C ₂ ^(RT)=0,  (22) C ₀ C ₂ ^(RT) +C ₁ C ₃ ^(RT) +C ₂ C ₀ ^(RT) +C ₃ C ₁ ^(RT)=0,  (23) C ₀ C ₁ ^(RT) +C ₁ C ₂ ^(RT) +C ₂ C ₃ ^(RT) +C ₃ C ₀ ^(RT)=0,  (24)

Proof. Let

$P = {\begin{pmatrix} 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \\ 1 & 0 & 0 & 0 \end{pmatrix}.}$ Then C can be rewritten as C=[I] ₄ {circle around (×)}C ₀ +P{circle around (×)}C ₁ +P ² {circle around (×)}C ₂ +P ³ {circle around (×)}C ₃, where {circle around (×)} is the Kronecker product. Then C is Jacket matrix if and only if CC^(RT)=N [I]_(N).

On the other hand, C^(RT)=[I]₄{circle around (×)}C₀ ^(RT)+P{circle around (×)}C₃ ^(RT)+P²{circle around (×)}C₂ ^(RT)+P³{circle around (×)}C₁ ^(RT).

Hence CC ^(RT) =[I] ₄{circle around (×)}(C ₀ C ₀ ^(RT))+P{circle around (×)}(C ₀ C ₃ ^(RT))+P ²{circle around (×)}(C ₀ C ₂)^(RT))+P ³{circle around (×)}(C ₀ C ₁ ^(RT))+[I] ₄{circle around (×)}(C ₁ C ₁ ^(RT))+P{circle around (×)}(C ₁ C ₀ ^(RT))+P ²{circle around (×)}(C ₁ C ₃)^(RT))+P ³{circle around (×)}(C ₁ C ₂ ^(RT))+[I] ₄{circle around (×)}(C ₂ C ₂ ^(RT))+P{circle around (×)}(C ₂ C ₁ ^(RT))+P ²{circle around (×)}(C ₂ C ₀)^(RT))+P ³{circle around (×)}(C ₂ C ₃ ^(RT))+[I] ₄{circle around (×)}(C ₃ C ₃ ^(RT))+P{circle around (×)}(C ₃ C ₂ ^(RT))+P ²{circle around (×)}(C ₃ C ₁)^(RT))+P ³{circle around (×)}(C ₃ C ₀ ^(RT))=N[I] ₄ {circle around (×)}[I] _(p) +P{circle around (×)}(C ₀ C ₃ ^(RT) +C ₁ C ₀ ^(RT) +C ₂ C ₁ ^(RT) +C ₃ C ₂ ^(RT))+P ²{circle around (×)}(C ₀ C ₂ ^(RT) +C ₁ C ₃ ^(RT) +C ₂ C ₀ ^(RT) +C ₃ C ₁ ^(RT))+P ³{circle around (×)}(C ₀ C ₁ ^(RT) +C ₁ C ₂ ^(RT) +C ₂ C ₃ ^(RT) +C ₃ C ₀ ^(RT)).

Hence [C]_(N) is Jacket matrix if and only equations (22), (23) and (24) hold.

From Theorem 3.2, we are able to construct block circulant Jacket matrices by choosing proper matrices C₀,C₁,C₂,C₃ such that they satisfy equation (22),(23) and (24). For example, let C₂=±C₀ and C₃=∓C₁ be Jacket matrices. Then C ₀ C ₃ ^(RT) +C ₁ C ₀ ^(RT) +C ₂ C ₁ ^(RT) +C ₃ C ₂ ^(RT) =−C ₀ C ₁ ^(RT) +C ₁ C ₀ ^(RT) +C ₀ C ₁ ^(RT) −C ₁ C ₀ ^(RT)=0, C ₀ C ₂ ^(RT) +C ₁ C ₃ ^(RT) +C ₂ C ₀ ^(RT) +C ₃ C ₁ ^(RT) =C ₀ C ₀ ^(RT) −C ₁ C ₁ ^(RT) +C ₀ C ₀ ^(RT) −C ₁ C ₁ ^(RT)=0, C ₀ C ₁ ^(RT) +C ₁ C ₂ ^(RT) +C ₂ C ₃ ^(RT) +C ₃ C ₀ ^(RT) =C ₀ C ₁ ^(RT) +C ₁ C ₀ ^(RT) −C ₀ C ₁ ^(RT) −C ₁ C ₀ ^(RT)=0.

Hence if C₀ and C₁ are Jacket matrices, then

$\lbrack C\rbrack_{4\; p} = \begin{pmatrix} C_{0} & C_{1} & C_{0} & {- C_{1}} \\ {- C_{1}} & C_{0} & C_{1} & C_{0} \\ C_{0} & {- C_{1}} & C_{0} & C_{1} \\ C_{1} & C_{0} & {- C_{1}} & C_{0} \end{pmatrix}$ is a block circulant Jacket matrix.

Example 2 Let

${{C_{0} = \begin{pmatrix} 1 & i \\ i & 1 \end{pmatrix}};{C_{1} = \begin{pmatrix} 1 & {- i} \\ {- i} & 1 \end{pmatrix}}},$ where I²=−1. It is easy to see that C₀,C₁ are Jacket matrices. Hence there is a block circulant Jacket matrix of order 8 in (25).

$\begin{matrix} \begin{matrix} {\lbrack C\rbrack_{8} = \begin{pmatrix} C_{0} & C_{1} & C_{0} & {- C_{1}} \\ {- C_{1}} & C_{0} & C_{1} & C_{0} \\ C_{0} & {- C_{1}} & C_{0} & C_{1} \\ C_{1} & C_{0} & {- C_{1}} & C_{0} \end{pmatrix}} \\ {= {\begin{pmatrix} 1 & i & 1 & {- i} & 1 & i & {- 1} & i \\ i & 1 & {- i} & 1 & i & 1 & i & {- 1} \\ {- 1} & i & 1 & i & 1 & {- i} & 1 & i \\ i & {- 1} & i & 1 & {- i} & 1 & i & 1 \\ 1 & i & {- 1} & i & 1 & i & 1 & {- i} \\ i & 1 & i & {- 1} & i & 1 & {- i} & 1 \\ 1 & {- i} & 1 & i & {- 1} & i & 1 & i \\ {- i} & 1 & i & 1 & i & {- 1} & 1 & i \end{pmatrix}.}} \end{matrix} & (25) \end{matrix}$

Example 3 Let W be the complex root of unitary and

$C_{0} = {{\begin{pmatrix} 1 & w & w \\ w & 1 & w \\ w & w & 1 \end{pmatrix}\mspace{14mu}{and}\mspace{14mu} C_{1}} = {\begin{pmatrix} 1 & 1 & w^{2} \\ w^{2} & 1 & 1 \\ 1 & w^{2} & 1 \end{pmatrix}.}}$

Then [C]₁₂ in (26) is a block circulant Jacket matrix.

$\begin{matrix} \begin{matrix} {\lbrack C\rbrack_{12} = \begin{pmatrix} C_{0} & C_{1} & C_{0} & {- C_{1}} \\ {- C_{1}} & C_{0} & C_{1} & C_{0} \\ C_{0} & {- C_{1}} & C_{0} & C_{1} \\ C_{1} & C_{0} & {- C_{1}} & C_{0} \end{pmatrix}} \\ {= \begin{pmatrix} 1 & w & w & 1 & 1 & w^{2} & 1 & w & w & {- 1} & {- 1} & {- w^{2}} \\ w & 1 & w & w^{2} & 1 & 1 & w & 1 & w & {- w^{2}} & {- 1} & {- 1} \\ w & w & 1 & 1 & w^{2} & 1 & w & w & 1 & {- 1} & {- w^{2}} & {- 1} \\ {- 1} & {- 1} & {- w^{2}} & 1 & w & w & 1 & 1 & w^{2} & 1 & w & w \\ {- w^{2}} & {- 1} & {- 1} & w & 1 & w & w^{2} & 1 & 1 & w & 1 & w \\ {- 1} & {- w^{2}} & {- 1} & w & w & 1 & 1 & w^{2} & 1 & w & w & 1 \\ 1 & w & w & {- 1} & {- 1} & {- w^{2}} & 1 & w & w & 1 & 1 & w^{2} \\ w & 1 & w & {- w^{2}} & {- 1} & {- 1} & w & 1 & w & w^{2} & 1 & 1 \\ w & w & 1 & {- 1} & {- w^{2}} & {- 1} & w & w & 1 & 1 & w^{2} & 1 \\ 1 & 1 & w^{2} & 1 & w & w & {- 1} & {- 1} & {- w^{2}} & 1 & w & w \\ w^{2} & 1 & 1 & w & 1 & w & {- w^{2}} & {- 1} & {- 1} & w & 1 & w \\ 1 & w^{2} & 1 & w & w & 1 & 1 & {- w^{2}} & {- 1} & w & w & 1 \end{pmatrix}} \end{matrix} & (26) \end{matrix}$

Example 4 Let

${C_{0} = \begin{pmatrix} 1 & 1 \\ 1 & {- 1} \end{pmatrix}},{C_{1} = \begin{pmatrix} a & {- a} \\ {- \frac{1}{a}} & {- \frac{1}{a}} \end{pmatrix}},$ C ₃ =iC ₁ C ₃ =iC ₀.

Then

$\lbrack C\rbrack_{4\; p} = \begin{pmatrix} C_{0} & C_{1} & C_{2} & C_{3} \\ C_{3} & C_{0} & C_{1} & C_{2} \\ C_{2} & C_{3} & C_{0} & C_{1} \\ C_{1} & C_{2} & C_{3} & C_{0} \end{pmatrix}$ is block circulant Jacket matrix.

C. Block Circulant Jacket Matrices of Order N=4^(k)p

Hereinafter, block circulant Jacket matrices of order N=4^(k)p with p×p blocks will be explained, where p is any integer. Let [C₀]_(p) and [C₁]_(p) are any two p×p Jacket matrices. Then the block circulant Jacket matrix of order 4p is defined to be

$\lbrack C\rbrack_{4\; p} = {:{\begin{pmatrix} C_{0} & C_{1} & C_{0} & {- C_{1}} \\ {- C_{1}} & C_{0} & C_{1} & C_{0} \\ C_{0} & {- C_{1}} & C_{0} & C_{1} \\ C_{1} & C_{0} & {- C_{1}} & C_{0} \end{pmatrix}.}}$

It has been proven that [C]_(4p) is block circulant Jacket matrix. For any two block circulant two matrices [C]₄ _(k) _(p) and [D]₄ _(k) _(p) of order 4^(k)p. The block cirulant matrix of order 4^(k+1)p with p×p block is defined to be

$\lbrack C\rbrack_{4^{k + 1}p} = {:{\begin{pmatrix} \lbrack C\rbrack_{4^{k}p} & \lbrack D\rbrack_{4^{k}p} & \lbrack C\rbrack_{4^{k}p} & {- \lbrack D\rbrack_{4^{k}p}} \\ {- \lbrack D\rbrack_{4^{k}p}} & \lbrack C\rbrack_{4^{k}p} & \lbrack D\rbrack_{4^{k}p} & \lbrack C\rbrack_{4^{k}p} \\ \lbrack C\rbrack_{4^{k}p} & {- \lbrack D\rbrack_{4^{k}p}} & \lbrack C\rbrack_{4^{k}p} & \lbrack D\rbrack_{4^{k}p} \\ \lbrack D\rbrack_{4^{k}p} & \lbrack C\rbrack_{4^{k}p} & {- \lbrack D\rbrack_{4^{k}p}} & \lbrack C\rbrack_{4^{k}p} \end{pmatrix}.}}$

It can be seen that block cirulant matrix [C]₄ _(k+1) _(p) of order 4^(k+1)p is Jacket matrix.

D. Block Circulant Jacket Matrices of Order np

Definition 3.3: Let C₀ and C₁ be two p×p Jacket matrices. Let

$\lbrack C\rbrack_{n\; p} = \begin{pmatrix} C_{0} & C_{1} & \ldots & C_{1} & C_{1} \\ C_{1} & C_{0} & \ldots & C_{1} & C_{1} \\ \ldots & \ldots & \ddots & \ldots & \ldots \\ C_{1} & C_{1} & \ldots & C_{1} & C_{0} \end{pmatrix}$ be the block circulant matrix.

Then [C]_(np) is Jacket matrix if and only if C ₀ C ₁ ^(RT) +C ₁ C ₀ ^(RT)=−(n−2)p[I] _(p).  (27)

Proof. Let

$P = \begin{pmatrix} 0 & 1 & 0 & \ldots & 0 \\ 0 & 0 & 1 & \ldots & 0 \\ \ldots & \ldots & \ldots & \ldots & \ldots \\ 1 & 0 & 0 & \ldots & 0 \end{pmatrix}$ be the permutation matrix of order n. can be rewritten as [C] _(np) =[I] _(n) {circle around (×)}C ₀ +P{circle around (×)}C ₁ +P ² {circle around (×)}C ₁ + . . . +P ^(n−1) {circle around (×)}C ₁.

Hence [C] _(np) ^(RT) =[I] _(n) {circle around (×)}C ₀ +P{circle around (×)}C _(n) ^(RT) +P ² {circle around (×)}C ₁ ^(RT) + . . . +P ^(n−1) {circle around (×)}C ₁ ^(RT). [C] _(np) [C] _(np) ^(RT)=([I] _(n) {circle around (×)}C ₁ +P ² {circle around (×)}C ₁ + . . . +P ^(n−1) {circle around (×)}C ₁)·([I] _(n) {circle around (×)}C ₀ +P{circle around (×)}C ₁ ^(RT) +P ² {circle around (×)}C ₁ ^(RT) + . . . +P ^(n−1) {circle around (×)}C ₁ ^(RT)) =[I]_(n){circle around (×)}(np[I] _(p))+P{circle around (×)}(C ₀ C ₁ ^(RT) +C ₁ C ₀ ^(RT)+(n−2)p[I] _(p))+P ²{circle around (×)}(C ₀ C ₁ ^(RT) +C ₁ C ₀ ^(RT)+(n−2)p[I] _(p))+ . . . +P ^(n−1){circle around (×)}(C ₀ C ₁ ^(RT) +C ₁ C ₀ ^(RT)+(n−2)p[I] _(p))

Hence [C]_(np) is Jacket matrix if and only if C ₀ C ₁ ^(RT) +C ₁ C ₀ ^(RT)=−(n−2)p[I] _(p).

Now let

$C_{0} = \begin{pmatrix} a & b \\ a & {- b} \end{pmatrix}$ and

$C_{1} = \begin{pmatrix} a & a \\ b & {- b} \end{pmatrix}$ be two Jacket matrices for any nonzero complex numbers a,b. Then

${{C_{0}C_{1}^{RT}} + {C_{1}C_{0}^{RT}}}=={\begin{pmatrix} {2 + \frac{a}{b} + \frac{b}{a}} & 0 \\ 0 & {2 + \frac{a}{b} + \frac{b}{a}} \end{pmatrix}.}$

Hence C₀C₁ ^(RT)+C₁C₀ ^(RT)=−2(n−2)[I]₂ if and only if

${{2 + \frac{a}{b} + \frac{b}{a}} = {{- 2}\left( {n - 2} \right)}},$ which implies that

$\frac{b}{a} = {\frac{{- \left( {n - 1} \right)} + \sqrt{n^{2} - {2n}}}{2}:={c.}}$ In this way, we have got a class of block circulant Jacket matrix of order 2n

${\lbrack C\rbrack_{np} = \begin{pmatrix} C_{0} & C_{1} & \ldots & C_{1} & C_{1} \\ C_{1} & C_{0} & \ldots & C_{1} & C_{1} \\ \ldots & \ldots & \ddots & \ldots & \ldots \\ C_{1} & C_{1} & \ldots & C_{1} & C_{0} \end{pmatrix}},$ with

$C_{0} = {{\begin{pmatrix} a & {ac} \\ a & {- {ac}} \end{pmatrix}\mspace{14mu}{and}\mspace{14mu} C_{1}} = \begin{pmatrix} a & a \\ {ac} & {- {ac}} \end{pmatrix}}$ with for all nonzero complex a.

Definition 3.4 Let

$\lbrack C\rbrack_{np} = \begin{pmatrix} C_{0} & C_{1} & C_{2} & C_{2} & \ldots & C_{2} & C_{2} \\ C_{2} & C_{0} & C_{1} & C_{2} & \ldots & C_{2} & C_{2} \\ \ldots & \ldots & \ldots & \ldots & \ddots & \ldots & \ldots \\ C_{1} & C_{2} & C_{2} & C_{2} & \ldots & C_{2} & C_{0} \end{pmatrix}$ be the block circulant matrix, where C₀,C₁,C₂ are p×p Jacket matrices. Then [C]_(np) is block Jacket matrix if and only if the following conditions hold. C ₀ C ₂ ^(RT) C ₁ C ₀ ^(RT) +C ₂ C ₁ ^(RT) +C ₂ C ₂ ^(RT) =−p(n−4)[I] _(p),  (28) C ₀ C ₂ ^(RT) C ₁ C ₂ ^(RT) +C ₂ C ₀ ^(RT) +C ₂ C ₁ ^(RT) =−p(n−4)[I] _(p),  (29) C ₀ C ₁ ^(RT) C ₁ C ₂ ^(RT) +C ₂ C ₀ ^(RT) +C ₂ C ₂ ^(RT) =−p(n−4)[I] _(p),  (30)

Proof. Let

$P = \begin{pmatrix} 0 & 1 & 0 & \ldots & 0 \\ 0 & 0 & 1 & \ldots & 0 \\ \ldots & \ldots & \ldots & \ldots & \ldots \\ 1 & 0 & 0 & \ldots & 0 \end{pmatrix}$ be the permutation matrix of order n.

Then [C]_(np)=[I]_(n){circle around (×)}C₀+P{circle around (×)}C₁+P²{circle around (×)}C₂+ . . . +P^(n−1){circle around (×)}C₂. Hence [C] _(np) ^(RT) =[I] _(n) {circle around (×)}C ₀ +P{circle around (×)}C ₂ ^(RT) +P ² {circle around (×)}C ₂ ^(RT) + . . . +P ² {circle around (×)}C ₂ ^(RT) +P ^(n−1) {circle around (×)}C ₁ ^(RT).

Hence [C]_(np)[C]_(np) ^(RT)=np[I]_(np) if and only if C ₀ C ₂ ^(RT) +C ₁ C ₀ ^(RT) +C ₂ C ₁ ^(RT) +C ₂ C ₂ ^(RT) =−p(n−4)[I] _(p), C ₀ C ₂ ^(RT) +C ₁ C ₂ ^(RT) +C ₂ C ₀ ^(RT) +C ₂ C ₁ ^(RT) =−p(n−4)[I] _(p), C ₀ C ₁ ^(RT) +C ₁ C ₂ ^(RT) +C ₂ C ₀ ^(RT) +C ₂ C ₂ ^(RT) =−p(n−4)[I] _(p).

Therefore the assertion hold.

Definition 3.5: Let

$\lbrack C\rbrack_{np} = \begin{pmatrix} C_{0} & C_{1} & C_{2} & C_{2} & \ldots & C_{2} & C_{2} \\ C_{2} & C_{0} & C_{1} & C_{2} & \ldots & C_{2} & C_{2} \\ \ldots & \ldots & \ldots & \ldots & \ddots & \ldots & \ldots \\ C_{1} & C_{2} & C_{2} & C_{2} & \ldots & C_{2} & C_{0} \end{pmatrix}$ be the block circulant Jacket matrix.

If C₀,C₁,C₂ are p×p Jacket matrices, then (C₁−C₂)(C₀ ^(RT)−C₂ ^(RT))=[0]_(p) and (C₀−C₂)(C₁ ^(RT)−C₂ ^(RT))=[0]_(p).

Proof. By subtracting equation (29) from (28), we have C ₁ C ₂ ^(RT) +C ₂ C ₂ ^(R) −C ₁ C ₂ ^(RT) −C ₂ C ₀ ^(RT)=0.

Hence C₁(C₀ ^(RT)−C₂ ^(RT))−C₂(C₀ ^(RT)−C₂ ^(RT))=0, which implies (C ₁ −C ₂)(C ₀ ^(RT) −C ₂ ^(RT))=[0]_(p).

Moreover, subtracting equation (30) from (29), we have C ₀ C ₂ ^(RT) +C ₂ C ₁ ^(RT) −C ₀ C ₁ ^(RT) −C ₂ C ₂ ^(RT)=0.

Hence C₀(C₁ ^(RT)−C₂ ^(RT))−C₂(C₁ ^(RT)−C₂ ^(RT))=0, which implies (C ₀ −C ₂)(C ₁ ^(RT) −C ₂ ^(RT))=[0]_(p). Therefore the assertion holds.

For example, let

${C_{0} = \begin{pmatrix} a & a \\ {aq} & {aq} \end{pmatrix}},{C_{1} = {\begin{pmatrix} {a + 1} & {a + 1} \\ {\left( {a + 1} \right)q} & {{- \left( {a + 1} \right)}q} \end{pmatrix}\mspace{14mu}{and}}}$ $C_{2} = {\begin{pmatrix} {a + 1} & {a + 1} \\ {aq} & {- {aq}} \end{pmatrix}.}$

Then C₀,C₁ and C₂ are Jacket matrices of order 2. Further

${{C_{0}C_{2}^{RT}} + {C_{1}C_{0}^{RT}} + {C_{2}C_{1}^{RT}} + {C_{2}C_{2}^{RT}}} = \begin{pmatrix} {{2\left( {\frac{a + 1}{a} + \frac{a}{a + 1}} \right)} + 4} & 0 \\ 0 & {{2\left( {\frac{a + 1}{a} + \frac{a}{a + 1}} \right)} + 4} \end{pmatrix}$ ${{{C_{0}C_{2}^{RT}} + {C_{1}C_{2}^{RT}} + {C_{2}C_{0}^{RT}} + {C_{2}C_{1}^{RT}}} = \begin{pmatrix} {2\left( {\frac{a + 1}{a} + \frac{a}{a + 1} + 2} \right.} & 0 \\ 0 & {{2\left( {\frac{a + 1}{a} + \frac{a}{a + 1}} \right)} + 4} \end{pmatrix}},{and}$ ${{C_{0}C_{1}^{RT}} + {C_{1}C_{2}^{RT}} + {C_{2}C_{0}^{RT}} + {C_{2}C_{2}^{RT}}} = {\begin{pmatrix} {{2\left( {\frac{a + 1}{a} + \frac{a}{a + 1}} \right)} + 4} & 0 \\ 0 & {{2\left( {\frac{a + 1}{a} + \frac{a}{a + 1}} \right)} + 4} \end{pmatrix}.}$

When

${{{2\left( {\frac{a + 1}{a} + \frac{a}{a + 1}} \right)} + 4} = {{- 2}\left( {n - 4} \right)}},$ [C]_(np) is a block circulant Jacket matrix.

Example 4, Let

$\lbrack C\rbrack_{8p} = \begin{pmatrix} C_{0} & C_{1} & C_{2} & C_{3} & \ldots & C_{6} & C_{7} \\ C_{7} & C_{0} & C_{1} & C_{2} & \ldots & C_{5} & C_{6} \\ \ldots & \ldots & \ldots & \ldots & \ddots & \ldots & \ldots \\ C_{1} & C_{2} & C_{3} & C_{4} & \ldots & C_{7} & C_{0} \end{pmatrix}$ be block circulant matrix. If C₀ and C₁ are p×p Jacket matrices. Moreover, if C₂=C₃=C₁, C₄=C₀, C₅=−C₁, C₆=C₁, C₇=−C₁, then [C]_(8p) is a block circulant Jacket matrix.

Example 5, Let

$\lbrack C\rbrack_{8p} = \begin{pmatrix} C_{0} & C_{1} & C_{2} & C_{3} & \ldots & C_{6} & C_{7} \\ C_{7} & C_{0} & C_{1} & C_{2} & \ldots & C_{5} & C_{6} \\ \ldots & \ldots & \ldots & \ldots & \ddots & \ldots & \ldots \\ C_{1} & C_{2} & C_{3} & C_{4} & \ldots & C_{7} & C_{0} \end{pmatrix}$ be block circulant matrix. If C₀ and C₁ are p×p Jacket matrices. Moreover, if C₂=C₃=C₀, C₄=−C₀, C₅=C₁, C₆=−C₀, C₇=C₀, then [C]_(8p) is a block circulant Jacket matrix.

Eigenvalues of Block Circulant Jacket Matrices

A. Eigenvalues of Block Circulant Jacket Matrices

Hereinafter, explanation will be made on eigenvalues of block circulant Jacket matrices.

Theorem 4.1. Let

$\lbrack C\rbrack_{np} = \begin{pmatrix} C_{0} & C_{1} & C_{2} & C_{3} & \ldots & C_{n - 2} & C_{n - 1} \\ C_{n - 1} & C_{0} & C_{1} & C_{2} & \ldots & C_{n - 3} & C_{n - 2} \\ \ldots & \ldots & \ldots & \ldots & \ddots & \ldots & \ldots \\ C_{1} & C_{2} & C_{3} & C_{4} & \ldots & C_{n - 1} & C_{0} \end{pmatrix}$ be the block circulant Jacket matrix.

If C₀, . . . , C_(n−1) have p common linearly independent eigenvectors, i.e., there exist p nonzero vectors ξ₁, . . . , ξ_(n) such that C_(j)ξ_(k)=λ_(k) ^((j))ξ_(k) for j=0, . . . , n−1, k=1, . . . , p, then the all eigenvalues of [C]_(np) are λ_(k) ⁽⁰⁾+ω^(j)λ_(k) ⁽¹⁾+ . . . +ω^((n−1)j)λ_(k) ^((n−1)) and corresponding eigenvector η_(j){circle around (×)}ξ_(k), for k=1, . . . , p, j=0,1, . . . , n−1, where

$\omega = {\mathbb{e}}^{{- \frac{2\;\pi}{n}}{\mathbb{i}}}$ and η_(j)=(ω⁰,ω^(j), . . . , ω^((n−1)j))

Proof. Let

$P = \begin{pmatrix} 0 & 1 & 0 & \ldots & 0 \\ 0 & 0 & 1 & \ldots & 0 \\ \ldots & \ldots & \ldots & \ldots & \ldots \\ 1 & 0 & 0 & \ldots & 0 \end{pmatrix}$ be the permutation matrix of order n.

It is easy to see that all eigenvalues are ω⁰,ω, . . . , ω^(n−1) corresponding eigenvectors η₀=(ω⁰,ω⁰, . . . , ω⁰)^(T), η₁=(ω⁰,ω¹, . . . , ω^(n−1))^(T), . . . , η_(j)=(ω⁰,ω^(j), . . . , ω^((n−1)j), . . . , η_(n−1)=(ω⁰,ω^(1(n−1)), . . . , ω^((n−1)(n−1)))^(T).

So Pη_(j)=ω^(i)η_(j). Further [C]_(np) can be rewritten as [C]_(np)=[I]_(n){circle around (×)}C₀+P{circle around (×)}C₁+P²{circle around (×)}C₂+ . . . +P^(n−1){circle around (×)}C₂. Note that (P^(r){circle around (×)}C_(r))(η_(j){circle around (×)}ξ_(k))=(P^(r)η_(j)){circle around (×)}(C_(r)ξ_(k))=(ω^(r)η_(j)){circle around (×)}(λ_(k) ^((r))ξ_(k))=(ω^(jr)λ_(k) ^((r)))(η_(j){circle around (×)}ξ_(k).

Hence

$\begin{matrix} {{\lbrack C\rbrack_{np}\left( {\eta_{j} \otimes \xi_{k}} \right)} = {{\left( {\sum\limits_{r + 0}^{n - 1}{P^{r} \otimes C_{r}}} \right)\left( {\eta_{j} \otimes \xi_{k}} \right)} = {{\sum\limits_{r = 0}^{n - 1}{\left( {P^{r} \otimes C_{r}} \right)\left( {\eta_{j} \otimes \xi_{k}} \right)}} = {\sum\limits_{r = 0}^{n - 1}{\left( {\omega^{jr}\lambda_{k}^{(r)}} \right){\left( {\eta_{j} \otimes \xi_{k}} \right).}}}}}} & (31) \end{matrix}$

So Σ_(r=0) ^(n−1)ω^(jr)λ_(k) ^((r)) is an eigenvalue of [C]_(np) and corresponding eigenvector (η_(j){circle around (×)}ξ_(k)), for j=0, . . . , n−1, k=1, . . . , p.

For example, let

$C_{0} = {{\begin{pmatrix} 1 & \omega & \omega \\ \omega & 1 & \omega \\ \omega & \omega & 1 \end{pmatrix}\mspace{14mu}{and}\mspace{14mu} C_{1}} = {{iC}_{0} = {\begin{pmatrix} i & {i\;\omega} & {i\;\omega} \\ {i\;\omega} & i & {i\;\omega} \\ {i\;\omega} & {i\;\omega} & i \end{pmatrix}.}}}$ where ω₃=1, I²=−1. It is easy to see that C₀ have three eigenvalues λ₁ ⁽⁰⁾=2+ω, λ₂ ⁽⁰⁾=2+ω², λ₃ ⁽⁰⁾=2+ω² corresponding eigenvectors,

${\xi_{1} = {\frac{1}{\sqrt{3}}\left( {1,1,1} \right)^{T}}},$

${\xi_{2} = {\frac{1}{\sqrt{3}}\left( {1,\omega,\omega^{2}} \right)^{T}}},{\xi_{3} = {\frac{1}{\sqrt{3}}{\left( {1,\omega^{2},\omega^{4}} \right)^{T}.}}}$ Then C₁=iC⁰ has three eigenvalues λ₁ ⁽¹⁾=i(2+ω), λ₁ ⁽²⁾=i(2+ω²), λ₃ ⁽¹⁾=i(2+ω²) corresponding eigenvectors,

${\xi_{1} = {\frac{1}{\sqrt{3}}\left( {1,1,1} \right)^{T}}},{\xi_{2} = {\frac{1}{\sqrt{3}}\left( {1,\omega,\omega^{2}} \right)^{T}}},{\xi_{3} = {\frac{1}{\sqrt{3}}{\left( {1,\omega^{2},\omega^{4}} \right)^{T}.}}}$

Then by Theorem 4.1, the block circulant Jacket matrix

$\lbrack C\rbrack_{4} = \begin{pmatrix} C_{0} & C_{1} \\ C_{1} & C_{0} \end{pmatrix}$ has eigenvalues λ₁ ⁽⁰⁾+λ₁ ⁽¹⁾=(2+ω)+i(2+ω)=(1+i)(2+ω), λ₂ ⁽⁰⁾+λ₂ ⁽¹⁾=(2+ω²)+i(2+ω²)=(1+i)(2+ω²), λ₃ ⁽⁰⁾+λ₃ ⁽¹⁾=(2+ω²)+i(2+ω²)=(1+i)(2+ω²), λ₁ ⁽⁰⁾+ωλ₁ ⁽¹⁾=(1+iω)(2+ω), λ₂ ⁽⁰⁾+ωλ₂ ⁽¹⁾=(1+iω)(2+ω²), λ₂ ⁽⁰⁾+ωλ₂ ⁽¹⁾=(1+iω)(2+ω²) and corresponding eigenvectors η₀{circle around (×)}ξ₁, η₀{circle around (×)}ξ₂, η₀{circle around (×)}ξ₃, η₁{circle around (×)}ξ₂, η₁{circle around (×)}ξ₃., where

${\eta_{0} = {\frac{1}{\sqrt{2}}\left( {1,1} \right)^{T}}},{\eta_{1} = {\frac{1}{\sqrt{2}}{\left( {1,{- 1}} \right)^{T}.}}}$

$\begin{matrix} {\lbrack C\rbrack_{8} = {\begin{pmatrix} C_{0} & C_{1} & C_{2} & C_{3} \\ C_{3} & C_{0} & C_{1} & C_{2} \\ C_{2} & C_{3} & C_{0} & C_{1} \\ C_{1} & C_{2} & C_{3} & C_{0} \end{pmatrix} = {\frac{1}{2\sqrt{2}}\begin{pmatrix} 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 \\ 1 & {- 1} & 1 & {- 1} & 1 & {- 1} & 1 & {- 1} \\ 1 & 1 & \omega & \omega & \omega^{2} & \omega^{2} & \omega^{3} & \omega^{3} \\ 1 & {- 1} & \omega & {- \omega} & \omega^{2} & {- \omega^{2}} & \omega^{3} & {- \omega^{3}} \\ 1 & 1 & \omega^{2} & \omega^{2} & \omega^{4} & \omega^{4} & \omega^{6} & \omega^{6} \\ 1 & {- 1} & \omega^{2} & {- \omega^{2}} & \omega^{4} & {- \omega^{4}} & \omega^{6} & {- \omega^{6}} \\ 1 & 1 & \omega^{3} & \omega^{3} & \omega^{6} & \omega^{6} & \omega^{9} & \omega^{9} \\ 1 & {- 1} & \omega^{3} & {- \omega^{3}} & \omega^{6} & {- \omega^{6}} & \omega^{9} & {- \omega^{9}} \end{pmatrix} \times \begin{pmatrix} {1 + i} & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & {1 - i} & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & {2 - {2i}} & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & {2 + {2i}} & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & {1 + i} & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & {1 - i} & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & {{- 2} + {2i}} & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & {{- 2} - {2i}} \end{pmatrix} \times \frac{1}{2\sqrt{2}}{\begin{pmatrix} 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 \\ 1 & {- 1} & 1 & {- 1} & 1 & {- 1} & 1 & {- 1} \\ 1 & 1 & \omega & \omega & \omega^{2} & \omega^{2} & \omega^{3} & \omega^{3} \\ 1 & {- 1} & \omega & {- \omega} & \omega^{2} & {- \omega^{2}} & \omega^{3} & {- \omega^{3}} \\ 1 & 1 & \omega^{2} & \omega^{2} & \omega^{4} & \omega^{4} & \omega^{6} & \omega^{6} \\ 1 & {- 1} & \omega^{2} & {- \omega^{2}} & \omega^{4} & {- \omega^{4}} & \omega^{6} & {- \omega^{6}} \\ 1 & 1 & \omega^{3} & \omega^{3} & \omega^{6} & \omega^{6} & \omega^{9} & \omega^{9} \\ 1 & {- 1} & \omega^{3} & {- \omega^{3}} & \omega^{6} & {- \omega^{6}} & \omega^{9} & {- \omega^{9}} \end{pmatrix}^{*}.}}}} & (32) \end{matrix}$

B. Block Circulant DFT Jacket Matrices

Hereinafter, explanation will be made on an efficient algorithm for a fast computation of the block circulant Jacket matrices. In order to present an algorithm, assume that there exist p nonzero unit orthogonal eigenvectors ξ₁, . . . , ξ_(n) such that C_(j)ξ_(k)=λ_(k) ^((j))ξ_(k) for j=0, . . . , n−1,k=1, . . . , p.

Let φ_(jk)=λ_(k) ⁽⁰⁾+ω^(j)λ_(k) ⁽¹⁾+ . . . +ω^((n−1)j)λ_(k) ^((n−1)).

Then the eigenvalues of np×np block circulant Jacket matrix

$\lbrack C\rbrack_{np} = \begin{pmatrix} C_{0} & C_{1} & C_{2} & C_{3} & \ldots & C_{n - 2} & C_{n - 1} \\ C_{n - 1} & C_{0} & C_{1} & C_{2} & \ldots & C_{n - 3} & C_{n - 2} \\ \ldots & \ldots & \ldots & \ldots & \ddots & \ldots & \ldots \\ C_{1} & C_{2} & C_{3} & C_{4} & \ldots & C_{n - 1} & C_{0} \end{pmatrix}$ are φ₀₁, . . . , φ_(0p),φ₁₁, . . . , φ_(n−1,1), . . . , φ_(n−1,p) and the corresponding eigenvectors, also we have η₀{circle around (×)}ξ₁, . . . , η₀{circle around (×)}ξ_(p),η₁{circle around (×)}ξ₁, . . . , η₁{circle around (×)}ξ_(p), . . . , η_(n−1){circle around (×)}ξ₁, . . . , η_(n−1){circle around (×)}ξ_(p).

Moreover, let [U]_(p):=(ξ₁, . . . , ξ_(p)) be a p×p unitary matrix. Then block circulant Jacket matrix [C]_(np) can be factored to [C] _(np)=([V] _(n) {circle around (×)}U _(p))diag(φ_(0,1), . . . , φ_(0,p),φ_(2,1) . . . , φ_(2,p), . . . , φ_(n−1,1), . . . , φ_(n−1,p))([V] _(n) {circle around (×)}[U] _(p))^(H), where H is Hermitian transpose. If C₀, . . . , C_(n−1) are circulant Jacket matrices, then we can choose that

${\lbrack U\rbrack_{p}:={\left( {\xi_{1},\ldots\;,\xi_{p}} \right) = \begin{pmatrix} u_{11} & u_{12} & \ldots & u_{1\; p} \\ u_{21} & u_{22} & \ldots & u_{2\; p} \\ \ldots & \ldots & \ddots & \ldots \\ u_{p\; 1} & u_{p\; 2} & \ldots & u_{pp} \end{pmatrix}}},$ where

${u_{k\; j} = {\mathbb{e}}^{\frac{({{({k - 1})}{({j - 1})}}}{2\;\pi}{\mathbb{i}}}},$ k,j=1, . . . , p, I²=−1. Since DFT has a fast algorithm, two Kronecker product of DFTs has fast algorithm.

For example, let

${C_{0} = \begin{pmatrix} 1 & i \\ i & 1 \end{pmatrix}},{C_{1} = \begin{pmatrix} 2 & {{- 2}i} \\ {{- 2}i} & 2 \end{pmatrix}},{C_{2} = \begin{pmatrix} 1 & i \\ i & 1 \end{pmatrix}},{C_{3} = {\begin{pmatrix} {- 2} & {2i} \\ {2i} & {- 2} \end{pmatrix}.}}$

Then C₀ has eigenvalues λ₁ ⁽⁰⁾=1+i and λ₂ ⁽⁰⁾=1−i corresponding eigenvectors

${\xi_{1} = {\frac{1}{\sqrt{2}}\left( {1,1} \right)^{T}}},{\xi_{1} = {\frac{1}{\sqrt{2}}\left( {1,{- 1}} \right)^{T}}},$ respectively. C₁ has λ₁ ⁽¹⁾=2−2i and λ₂ ⁽¹⁾=2+2i corresponding eigenvectors

${\xi_{1} = {\frac{1}{\sqrt{2}}\left( {1,1} \right)^{T}}},{\xi_{1} = {\frac{1}{\sqrt{2}}\left( {1,{- 1}} \right)^{T}}},$ respectively. Then C₂ has eigenvalues λ₁ ⁽²⁾=1+i and λ₂ ⁽²⁾=1−i corresponding eigenvectors

${\xi_{1} = {\frac{1}{\sqrt{2}}\left( {1,1} \right)^{T}}},{\xi_{1} = {\frac{1}{\sqrt{2}}\left( {1,{- 1}} \right)^{T}}},$ respectively. C₃ has λ₁ ⁽³⁾=−2+2i and λ₂ ⁽³⁾=−2−2i corresponding eigenvectors

${\xi_{1} = {\frac{1}{\sqrt{2}}\left( {1,1} \right)^{T}}},{\xi_{1} = {\frac{1}{\sqrt{2}}\left( {1,{- 1}} \right)^{T}}},$ respectively.

${\lbrack V\rbrack_{4} = {\left( {\eta_{0},\eta_{1},\eta_{2},\eta_{3}} \right) = {{\frac{1}{2}\begin{pmatrix} V_{11} & V_{12} & V_{13} & V_{14} \\ V_{21} & V_{22} & V_{23} & V_{24} \\ V_{31} & V_{32} & V_{33} & V_{34} \\ V_{41} & V_{42} & V_{43} & V_{44} \end{pmatrix}} = \begin{pmatrix} 1 & 1 & 1 & 1 \\ 1 & \omega & \omega^{2} & \omega^{3} \\ 1 & \omega^{2} & \omega^{4} & \omega^{6} \\ 1 & \omega^{3} & \omega^{6} & \omega^{9} \end{pmatrix}}}},{\omega^{4} = 1},{{\eta_{0} \otimes \xi_{1}} = {\frac{1}{2\sqrt{2}}\left( {1,1,1,1,1,1,1,1} \right)^{T}}}$ ${\eta_{0} \otimes \xi_{2}} = {\frac{1}{2\sqrt{2}}\left( {1,{- 1},1,{- 1},1,{- 1},1,{- 1}} \right)^{T}}$ ${\eta_{1} \otimes \xi_{1}} = {\frac{1}{2\sqrt{2}}\left( {1,1,\omega,\omega,\omega^{2},\omega^{2},\omega^{3},\omega^{3}} \right)^{T}}$ ${\eta_{1} \otimes \xi_{2}} = {\frac{1}{2\sqrt{2}}\left( {1,{- 1},\omega,{- \omega},\omega^{2},{- \omega^{2}},\omega^{3},{- \omega^{3}}} \right)^{T}}$ ${\eta_{2} \otimes \xi_{1}} = {\frac{1}{2\sqrt{2}}\left( {1,1,\omega^{2},\omega^{2},\omega^{4},\omega^{4},\omega^{6},\omega^{6}} \right)^{T}}$ ${\eta_{2} \otimes \xi_{2}} = {\frac{1}{2\sqrt{2}}\left( {1,{- 1},\omega^{2},{- \omega^{2}},\omega^{4},{- \omega^{4}},\omega^{6},{- \omega^{6}}} \right)^{T}}$ ${{\eta_{3} \otimes \xi_{1}} = {\frac{1}{2\sqrt{2}}\left( {1,1,\omega^{3},\omega^{3},\omega^{6},\omega^{6},\omega^{9},\omega^{9}} \right)^{T}}},{{\eta_{3} \otimes \xi_{2}} = {\frac{1}{2\sqrt{2}}{\left( {1,{- 1},\omega^{3},{- \omega^{3}},\omega^{6},{- \omega^{6}},\omega^{9},{- \omega^{9}}} \right)^{T}.}}}$

The fast block circulant Jacket transform.

The Hadamard transform, Y, of a 2^(n)×1 vector X is defined as Y=H _(n) X,  (33) straightforward calculation of (33) requires O(2^(2n)) arithmetic operation. There are fast methods just as there are fast methods for calculate similar transforms such as the Fourier transform. On the while, the fast BCJT is the similar fashion as fast Hadamard transform, [C] _(np) =[I] _(n) {circle around (×)}C ₀ +P{circle around (×)}C ₁ +P ² {circle around (×)}C ₁ + . . . +P ^(n−1) {circle around (×)}C ₁ , H _(N)=(H ₂ {circle around (×)}I _(N/2))(I ₂ {circle around (×)}H _(N/2))

Let C₀ and C₁ be two p×p Jacket matrices.

Let

$\lbrack C\rbrack_{np} = \begin{pmatrix} C_{0} & C_{1} & \ldots & C_{1} & C_{1} \\ C_{1} & C_{0} & \ldots & C_{1} & C_{1} \\ \ldots & \ldots & \ddots & \ldots & \ldots \\ C_{1} & C_{1} & \ldots & C_{1} & C_{0} \end{pmatrix}$ be a block circulant Jacket matrix.

Further [C]_(np) can be rewritten as [C] _(np) =[I] _(n) {circle around (×)}C ₀ +P{circle around (×)}C ₁ +P ² {circle around (×)}C ₁ + . . . +P ^(n−1) {circle around (×)}C ₁.

As an example, N=8 case, [C] ₈ =[I] ₄ {circle around (×)}C ₀ +P{circle around (×)}C ₀ +P ² {circle around (×)}C ₀ +P ³ {circle around (×)}C ₁,

$P = \begin{pmatrix} 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \\ 1 & 0 & 0 & 0 \end{pmatrix}$ is the permutation matrix.

Then, we have

$\begin{matrix} {{{\lbrack C\rbrack_{8} = {{\left( {\lbrack H\rbrack_{2} \otimes \lbrack I\rbrack_{4}} \right)\begin{bmatrix} {I_{2} \otimes I_{2}} & {I_{2} \otimes I_{2}} \\ {{\hat{P}}_{2} \otimes I_{2}} & {{\overset{\_}{P}}_{2} \otimes I_{2}} \end{bmatrix}}\left( {I_{4} \otimes H_{2}} \right)}},{where}}{{{\hat{P}}_{2} = \begin{bmatrix} 0 & 1 \\ {- 1} & 0 \end{bmatrix}},{{\overset{\_}{P}}_{2} = {\begin{bmatrix} 0 & {- 1} \\ 1 & 0 \end{bmatrix}.}}}} & (34) \end{matrix}$

Therefore,

$\begin{matrix} {\lbrack C\rbrack_{8} = {\begin{bmatrix} 1 & 1 & 1 & 1 & 1 & 1 & {- 1} & {- 1} \\ 1 & {- 1} & 1 & {- 1} & 1 & {- 1} & {- 1} & 1 \\ {- 1} & {- 1} & 1 & 1 & 1 & 1 & 1 & 1 \\ {- 1} & 1 & 1 & {- 1} & 1 & {- 1} & 1 & {- 1} \\ 1 & 1 & {- 1} & {- 1} & 1 & 1 & 1 & 1 \\ 1 & {- 1} & {- 1} & 1 & 1 & {- 1} & 1 & {- 1} \\ 1 & 1 & 1 & 1 & {- 1} & {- 1} & 1 & 1 \\ 1 & {- 1} & 1 & {- 1} & {- 1} & 1 & 1 & {- 1} \end{bmatrix} = {{{\left\lbrack \begin{matrix} 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 \\ 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} \end{matrix} \right\rbrack\left\lbrack \begin{matrix} 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} \\ {- 1} & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & {- 1} & 0 & 0 & 0 & 1 & 0 & 0 \end{matrix} \right\rbrack}\begin{bmatrix} 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\ 1 & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & {- 1} & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 1 & {- 1} & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 \\ 0 & 0 & 0 & 0 & 0 & 0 & 1 & {- 1} \end{bmatrix}}.}}} & (35) \end{matrix}$

Also, for the inverse transform, we have

$\begin{matrix} {\lbrack C\rbrack_{8}^{- 1} = {{\frac{1}{8}\begin{bmatrix} 1 & 1 & {- 1} & {- 1} & 1 & 1 & 1 & 1 \\ 1 & {- 1} & {- 1} & 1 & 1 & {- 1} & 1 & {- 1} \\ 1 & 1 & 1 & 1 & {- 1} & {- 1} & 1 & 1 \\ 1 & {- 1} & 1 & {- 1} & {- 1} & 1 & 1 & {- 1} \\ 1 & 1 & 1 & 1 & 1 & 1 & {- 1} & {- 1} \\ 1 & {- 1} & 1 & {- 1} & 1 & {- 1} & {- 1} & 1 \\ {- 1} & {- 1} & 1 & 1 & 1 & 1 & 1 & 1 \\ {- 1} & 1 & 1 & {- 1} & 1 & {- 1} & 1 & {- 1} \end{bmatrix}} = {{{{\frac{1}{8}\left\lbrack \begin{matrix} 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & {- 1} & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & {- 1} & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 1 & {- 1} & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 \\ 0 & 0 & 0 & 0 & 0 & 0 & 1 & {- 1} \end{matrix} \right\rbrack}\left\lbrack \begin{matrix} 1 & 0 & 0 & 0 & 0 & 0 & {- 1} & 0 \\ 0 & 1 & 0 & 0 & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 1 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 1 & 0 & 0 \\ 1 & 0 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 1 & 0 & 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 & {- 1} & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & {- 1} & 0 & 0 \end{matrix} \right\rbrack}\begin{bmatrix} 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 \\ 1 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & {- 1} & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & {- 1} & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & {- 1} \end{bmatrix}}.}}} & (36) \end{matrix}$

Note that, [C]₈[C]₈ ⁻¹=[I]₈.

Then, we can get a general formula,

$\begin{matrix} {{\lbrack C\rbrack_{N} = {{\lbrack/\rbrack_{4} \otimes C_{0}} + {P \otimes C_{0}} + \ldots\; + {P^{{N/2} - 2} \otimes C_{0}} + {P^{{N/2} - 1} \otimes C_{1}}}},{{{where}\mspace{14mu} N} = 2^{k}},{k = 3},4,{\ldots\; = {{\left( {\lbrack H\rbrack_{2} \otimes \lbrack/\rbrack_{N/2}} \right)\begin{bmatrix} {I_{2} \otimes I_{N/4}} & {I_{2} \otimes I_{N/4}} \\ {{\hat{P}}_{2} \otimes I_{N/4}} & {{\overset{\_}{P}}_{2} \otimes I_{N/4}} \end{bmatrix}}\mspace{14mu}\ldots\mspace{14mu}{\left( {I_{N/2} \otimes H_{2}} \right).}}}} & (38) \end{matrix}$

The [C]_(N) general formula (37) is similar fashion as the Hadamard. H _(N)=([H] ₂ {circle around (×)}[I] _(N/2))(I _(N/2) {circle around (×)}H ₂)  [5, eq. (4)].

FIGS. 3 and 4 show a fast forward flow graph of BCJM and inverse BCJM transform, then we compute the complexity of this decomposed factor of the proposed transform. Firstly, for the block matrix C₀, there needs a multiplications and b additions. We can compare the computation complexity in the fast algorithm and the direct computation.

Since in C₀(X₀+X₂)+C₁(X₁+X₃), there needs 2b+3p additions and 2a multiplications. Then for the order=4²p, there needs 2(2b+3p)+3p additions and 2·2a multiplications. Note that 2(2b+3p)+3p=2² b+3p(2+1)=2² b+3p(2²−1).

Hence for C₄ _(k) _(p) needs 2^(k)b+3p(2^(k)−1) additions and 2 ^(k)a multiplications. However for C_(np), there needs 2b+(p−1)n additions and 2a multiplications. The Table 1 show that the complexity of the present disclosure is better than direct calculation. It reduces about 50% when it applies to the multiplications. In the order of 4p,

$\lbrack C\rbrack_{4p} = {\begin{pmatrix} C_{0} & C_{1} & C_{0} & {- C_{1}} \\ {- C_{1}} & C_{0} & C_{1} & C_{0} \\ C_{0} & {- C_{1}} & C_{0} & C_{1} \\ C_{1} & C_{0} & {- C_{1}} & C_{0} \end{pmatrix}.}$

In this block circulant Jacket matrix, we have

${\lbrack C\rbrack_{4\; p}\chi} = {{\begin{pmatrix} C_{0} & C_{1} & C_{0} & {- C_{1}} \\ {- C_{1}} & C_{0} & C_{1} & C_{0} \\ C_{0} & {- C_{1}} & C_{0} & C_{1} \\ C_{1} & C_{0} & {- C_{1}} & C_{0} \end{pmatrix}\begin{pmatrix} \chi_{0} \\ \chi_{1} \\ \chi_{2} \\ \chi_{3} \end{pmatrix}} = {\begin{pmatrix} {{C_{0}\left( {\chi_{0} + \chi_{2}} \right)} + {C_{1}\left( {\chi_{1} - \chi_{3}} \right)}} \\ {{C_{0}\left( {\chi_{1} + \chi_{3}} \right)} + {C_{1}\left( {{- \chi_{0}} + \chi_{2}} \right)}} \\ {{C_{0}\left( {{- \chi_{0}} + \chi_{2}} \right)} + {C_{1}\left( {{- \chi_{1}} + \chi_{3}} \right)}} \\ {{C_{0}\left( {\chi_{1} + \chi_{3}} \right)} + {C_{1}\left( {\chi_{0} - \chi_{2}} \right)}} \end{pmatrix}.}}$

It is very clear that we have 2b+3p additions and 2a multiplications in C₀(X₀+X₂)+C₁(X₁+X₂), and same in the others. The architecture of the fast BCJM is shown in FIG. 5. The shift register provides the block circulant matrix units, and fast algorithm products the whole matrix by using proper construction.

Capacity of a Time-Invariant MIMO Gaussian Channel Based the BCJM

We can apply the BCJM to improve time-invariant Gaussian MIMO channel capacity. For a MIMO system with N_(T) transmit and N_(R) receive antennas, as shown in FIG. 6, a narrowband time-invariant wireless channel can be represented by N_(R)×N_(T) deterministic matrix H∈C^(N) ^(R) ^(×N) ^(T) . Consider a transmitted symbol vector x∈C^(N) ^(T) ^(×1), which is composed of N_(T) independent input symbols x₁,x₂, . . . , x_(N) _(T) . Then, the received signal y∈C^(N) ^(R) ^(×1) can be rewritten in a matrix form as follows:

$\begin{matrix} {{\gamma = {{\sqrt{\frac{E_{\chi}}{N_{T}}}H\;\chi} + Z}},} & (39) \end{matrix}$ where z=(z₁,z₂, . . . , z_(N) _(r) )^(T)∈C^(N) ^(R) ^(×1) is a noise vector, which is assumed to be zero-mean circular symmetric complex Gaussian (ZMCSCG). E_(x) is the energy of the transmitted signals. Note that the noise vector z is referred to as circular symmetric when e^(jθ)z has the same distribution as z for any θ. The autocorrelation of transmitted signal vector is defined as R _(xx) =E[xx ^(H)].  (40)

Note that Tr(R_(xx))=N_(T) the transmission power for each transmit antenna is assumed to be 1.

In general, the MIMO channel gains are not independent and identically distributed (i.i.d.). The channel correlation is closely related to the capacity of the MIMO channel. In the sequel, we consider the capacity of the MIMO channel when the channel gains between transmit and received antennas are correlated. When the SNR is high, the deterministic channel capacity can be approximated as

$\begin{matrix} {C \approx {{\max\limits_{{{Tr}{(R_{\chi\chi})}} = N}{\log_{2}{\det\left( R_{\chi\chi} \right)}}} + {\log_{2}{\det\left( {\frac{E_{\chi}}{{NN}_{0}}H_{W}H_{W}^{H}} \right)}}}} & (41) \end{matrix}$

From Equation (41), we can see that the second term is constant, while the first term involving det(R_(xx)) maximized when R_(xx)=I_(N). Consider the following correlated channel model: H=R _(r) ^(1/2) H _(W) R _(t) ^(1/2)  (42) where R_(t) is the correlation matrix, reflecting the correlations between the transmit antennas (i.e., the correlations between the column vectors of H), R_(r) is the correlation matrix reflecting the correlations between the receive antennas (i.e., the correlations between the row vectors of H), and H_(W) denotes the i.i.d. Rayleigh fading channel gain matrix. The diagonal entries of R_(t) and R_(r) are constrained to be a unity. Then, the MIMO channel is given as

$\begin{matrix} {C = {\log_{2}{\det\left( {{/_{N_{R}}{+ \frac{E_{\chi}}{N_{T}N_{0}}}}R_{r}^{1/2}H_{w}R_{t}H_{w}^{H}R_{r}^{\frac{H}{2}}} \right)}}} & (43) \end{matrix}$

Simulation computes the ergodic MIMO channel capacity when there exists a correlation between the transmit and receive antennas, with the following channel correlation matrices: R _(r) =I ₄(rank(R _(r)=1)).

Case 1: Toeplitz channel matrix

We have the R_(t) is a Toeplitz matrix, an n×n matrix T_(n)=[t_(k,j);k,j=0, 1, . . . , n−1], where t_(k,j)=t_(k−j), i.e., a matrix of the form.

$\begin{matrix} {R_{t} = {\begin{pmatrix} t_{0} & t_{- 1} & t_{- 2} & \ldots & t_{- {({n - 1})}} \\ t_{1} & t_{0} & t_{- 1} & \; & \; \\ t_{2} & t_{1} & t_{0} & \; & \vdots \\ \vdots & \; & \; & \ddots & \; \\ t_{n - 1} & \; & \; & \ldots & t_{0} \end{pmatrix}.}} & (44) \end{matrix}$

R_(r)=I₄ states that no correlation exists between the receive antennas.

From which it can be shown that a capacity of 3.3 bps/Hz is lost due to the channel correlation when SNR is 18 dB.

Case 2: Block circulant Jacket correlation matrix.

We have the R_(t) is a Block circulant matrix.

$\begin{matrix} {{R_{t} = \begin{pmatrix} \begin{pmatrix} 1 & 1 \\ 1 & {- 1} \end{pmatrix} & {\rho\begin{pmatrix} 1 & 1 \\ 1 & {- 1} \end{pmatrix}} \\ {\rho\begin{pmatrix} 1 & 1 \\ 1 & {- 1} \end{pmatrix}} & \begin{pmatrix} 1 & 1 \\ 1 & {- 1} \end{pmatrix} \end{pmatrix}},{{{where}\mspace{14mu} 0} < \rho < 1.}} & (45) \end{matrix}$

From FIG. 8, we observe that the block circulant Kronecker channel capacity could improve than conventional MIMO as an efficient capacity achieving scheme at high signal-to-noise ratio regime. FIG. 9 shows the average BER performance versus input SNR for comparing the transceiver scheme of the present disclosure with the existing transceiver algorithms. It can be seen that lower correlation coefficients lead to a better performance. FIG. 10 shows the CDFs of the correlated 2×2 and 4×4 MIMO channel capacities, it is clear from figures that the MIMO channel capacity improves with increasing the number of transmit and receive antennas.

Kronecker MIMO 2×2 BCJM Channel

In example 1, and FIG. 1, consider the Kronecker MIMO 2×2 BCJM channel as following, transceiver the power correlation are set to |μ|²,|ρ|²: |μ|²=

|α₁₁|²,|α₂₁|²

=

|α₁₂|²,|α₂₂|²

|ρ|²=

|α₁₁|²,|α₂₁|²

=

|α₁₂|²,|α₂₂|²

  (46)

Taking into account the fact that correlation matrices are, let C₀ be Hadamard H₂ matrix, the BCJM spatial correlation matrices are defined as follows

$\begin{matrix} {{{R_{T_{\chi}}@\begin{pmatrix} C_{0} & {C_{0}\mu} \\ \left( {C_{0}\mu} \right)^{*} & C_{0} \end{pmatrix}} = \begin{pmatrix} H_{2} & {H_{2}\mu} \\ \left( {H_{2}\mu} \right)^{*} & H_{2} \end{pmatrix}},} & (47) \\ {{R_{R_{\chi}}@\begin{pmatrix} H_{2} & {H_{2}\rho} \\ \left( {H_{2}\rho} \right)^{*} & H_{2} \end{pmatrix}}.} & (48) \end{matrix}$

Note that R_(T) _(x) and R_(R) _(x) and can be replaced by R_(MS) and R_(BS) in up-link or R_(BS) and R_(MS) in down-link, respectively. The Kronecker product MIMO 2×2 BCJM channel matrix as follows R _(MIMO) =R _(T) _(x) {circle around (×)}R _(R) _(x) .  (49)

The Cholesky decomposition of Γ is given by

$\begin{matrix} {{\Gamma = {{R_{MIMO} \times P} = {{\begin{bmatrix} H_{2}^{2} & {\rho H}_{2}^{2} & {\mu H}_{2}^{2} & {{\mu\rho}H}_{2}^{2} \\ {\rho^{*}H_{2}^{2}} & H_{2}^{2} & {{\mu\rho}^{*}H_{2}^{2}} & {\mu\; H_{2}^{2}} \\ \mu^{*} & {H_{2}^{2}\mu^{*}\rho\; H_{2}^{2}} & H_{2}^{2} & {\rho\; H_{2}^{2}} \\ {\mu^{*}\rho^{*}H_{2}^{2}} & \mu^{*} & {H_{2}^{2}\rho^{*}H_{2}^{2}} & H_{2}^{2} \end{bmatrix} \times \mspace{160mu}\left\lbrack \begin{matrix} \sigma_{\alpha_{11}}^{2} & {\sigma_{\alpha_{11}}\sigma_{\alpha_{12}}} & {\sigma_{\alpha_{11}}\sigma_{\alpha_{21}}} & {\sigma_{\alpha_{11}}\sigma_{\alpha_{22}}} \\ {\sigma_{\alpha_{12}}\sigma_{\alpha_{11}}} & \sigma_{\alpha_{12}}^{2} & {\sigma_{\alpha_{12}}\sigma_{\alpha_{21}}} & {\sigma_{\alpha_{12}}\sigma_{\alpha_{22}}} \\ {\sigma_{\alpha_{21}}\sigma_{\alpha_{11}}} & {\sigma_{\alpha_{21}}\sigma_{\alpha_{12}}} & \sigma_{\alpha_{21}}^{2} & {\sigma_{\alpha_{21}}\sigma_{\alpha_{22}}} \\ {\sigma_{\alpha_{22}}\sigma_{\alpha_{11}}} & {\sigma_{\alpha_{22}}\sigma_{\alpha_{12}}} & {\sigma_{\alpha_{22}}\sigma_{\alpha_{21}}} & \sigma_{\alpha_{22}}^{2} \end{matrix} \right\rbrack} = \begin{bmatrix} {H_{2}^{2}\sigma_{\alpha_{11}}^{2}} & {H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{12}}\rho} & {H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{21}}\mu} & {H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{22}}\rho\;\mu} \\ {H_{2}^{2}\sigma_{\alpha_{12}}\sigma_{\alpha_{11}}\rho^{*}} & {H_{2}^{2}\sigma_{\alpha_{12}}^{2}} & {H_{2}^{2}\sigma_{\alpha_{12}}\sigma_{\alpha_{21}}\mu\;\rho^{*}} & {H_{2}^{2}\sigma_{\alpha_{12}}\sigma_{\alpha_{22}}\mu} \\ {H_{2}^{2}\sigma_{\alpha_{21}}\sigma_{\alpha_{11}}\mu^{*}} & {H_{2}^{2}\sigma_{\alpha_{21}}\sigma_{\alpha_{12}}\mu^{*}\rho} & {H_{2}^{2}\sigma_{\alpha_{21}}^{2}} & {H_{2}^{2}\sigma_{\alpha_{21}}\sigma_{\alpha_{22}}\rho} \\ {H_{2}^{2}\sigma_{\alpha_{22}}\sigma_{\alpha_{11}}\mu^{*}\rho^{*}} & {H_{2}^{2}\sigma_{\alpha_{22}}\sigma_{\alpha_{12}}\mu^{*}} & {H_{2}^{2}\sigma_{\alpha_{22}}\sigma_{\alpha_{21}}\rho^{*}} & {H_{2}^{2}\sigma_{\alpha_{22}}^{2}} \end{bmatrix}}}},} & (50) \end{matrix}$ where P is a power shaping matrix, C is a lower triangular matrix.

$\begin{matrix} {{C = \begin{bmatrix} {H_{2}\sigma_{\alpha_{11}}} & 0 & 0 & 0 \\ {H_{2}\sigma_{\alpha_{12}}} & {H_{2}\sigma_{\alpha_{12}}^{2}\phi} & 0 & 0 \\ {H_{2}\sigma_{\alpha_{21}}} & 0 & {H_{2}\sigma_{\alpha_{12}}^{2}\varphi} & 0 \\ {H_{2}\sigma_{\alpha_{22}}} & {H_{2}\sigma_{\alpha_{22}}\mu^{*}\phi} & {H_{2}\sigma_{\alpha_{22}}\rho^{*}\varphi} & {H_{2}\sigma_{\alpha_{22}}\psi} \end{bmatrix}},} & (51) \end{matrix}$ where Φ=√{square root over (1−|ρ|²)},φ=√{square root over (1−|μ|²)},ψ=√{square root over (1+|μ|²|ρ|²−|μ|²−|ρ|²|)}.

Therefore some complex coefficients are derived as following, since W has unit variance.

Then we can have

$\begin{matrix} {\left\langle {{H_{2}\alpha_{11}},{H_{2}\alpha_{11}}} \right\rangle = {\frac{H_{2}^{2}{E\left\lbrack {\alpha_{11}\alpha_{11}^{*}} \right\rbrack}}{H_{2}^{2}\sigma_{\alpha_{11}}^{2}} = {\frac{H_{2}^{2}{E\left\lbrack {\alpha_{11}w\;\alpha_{11}w^{*}} \right\rbrack}}{H_{2}^{2}\sigma_{\alpha_{11}}^{2}} = {\frac{H_{2}^{2}\sigma_{\alpha_{11}}^{2}{E\left\lbrack {ww}^{*} \right\rbrack}}{H_{2}^{2}\sigma_{\alpha_{11}}^{2}} = 1}}}} & (52) \\ {\left\langle {{H_{2}\alpha_{11}},{H_{2}\alpha_{12}}} \right\rangle = {\frac{H_{2}^{2}{E\left\lbrack {\alpha_{11}\alpha_{12}^{*}} \right\rbrack}}{H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{12}}} = {\frac{H_{2}^{2}{E\left\lbrack {\sigma_{\alpha_{11}}{w\left( {{\sigma_{\alpha_{12}}{\rho\;}^{*}w} + {\sigma_{\alpha_{12}}\sqrt{1 - {\rho }^{2}}\chi}} \right)}^{*}} \right\rbrack}}{H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{12}}} = {\frac{{H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{12}}\rho\;{E\left\lbrack {ww}^{*} \right\rbrack}} + {H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{12}}\sqrt{1 - {\rho }^{2}}{E\left\lbrack {w\;\chi^{*}} \right\rbrack}}}{H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{12}}} = \rho}}}} & (53) \\ {\left\langle {{H_{2}\alpha_{11}},{H_{2}\alpha_{21}}} \right\rangle = {\frac{H_{2}^{2}{E\left\lbrack {\alpha_{11}\alpha_{21}^{*}} \right\rbrack}}{H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{11}}} = {\frac{H_{2}^{2}{E\left\lbrack {\sigma_{\alpha_{11}}{w\left( {{\sigma_{\alpha_{21}}\mu^{*}w} + {\sigma_{\alpha_{21}}\sqrt{1 - {\mu }^{2}}y}} \right)}^{*}} \right\rbrack}}{H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{21}}} = {\frac{{H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{21}}\mu\;{E\left\lbrack {ww}^{*} \right\rbrack}} + {H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{21}}\sqrt{1 - {\mu }^{2}}{E\left\lbrack {wy}^{*} \right\rbrack}}}{H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{21}}} = \mu}}}} & (54) \\ {\left\langle {{H_{2}\alpha_{11}},{H_{2}\alpha_{22}}} \right\rangle = {\frac{H_{2}^{2}{E\left\lbrack {\alpha_{11}\alpha_{22}^{*}} \right\rbrack}}{H_{2}^{2}\sigma_{\alpha_{11}}\sigma_{\alpha_{22}}} = {\mu\;\rho}}} & (55) \end{matrix}$

Similarly, the rest correlation terms can be derived and are shown as following:

$\begin{matrix} {R_{MIMO} = {\begin{bmatrix} 1 & \rho & \mu & {\mu\;\rho} \\ \rho^{*} & 1 & {\mu\;\rho^{*}} & \mu \\ \mu^{*} & {\mu^{*}\rho} & 1 & \rho \\ {\mu^{*}\rho^{*}} & \mu^{*} & \rho^{*} & 1 \end{bmatrix}.}} & (56) \end{matrix}$

If σ_(α11) ²=σ_(α12) ²=σ_(α21) ²=σ_(α22) ²=σ_(α11)σ_(α11)=σ_(α11)σ_(α21)=σ_(α12)σ_(α21)=σ_(α12)σ_(α22)=σ_(α21)σ_(α11)=σ_(α21)σ_(α12)=σ_(α21)σ_(α22)=σ_(α21)σ_(α11)=σ_(α22)σ_(α11)=σ_(α22)σ_(α12)=σ_(α22)σ_(α21).

Then, we have R _(MIMO) =R _(Tx) {circle around (×)}R _(Rx) =CC ^(T),  (57) where {circle around (×)} is the Kronecker product, C is a lower triangular Cholesky factorization matrix.

CONCLUSION

The circulant Hadamard conjecture presumes the existence of real Hadamard matrices in every doubly even order, while Ryser conjectured that there does not exist any circulant real Hadamard matrix of order n>4. We have proved the circulant Hadmard conjecture, based on the generalized Hadmard which called the block circulant Jacket matrix, also proposed a new class of block circulant Jacket matrices of order N=2p,4p,4^(k)p,np. Since the transform is the Jacket matrix, the inverse transform could be easily obtained by the reciprocal transpose operations. The orthogonal BCJM of the present disclosure is a fast efficient algorithm with complexity reduced by nearly 50% when it applies to the multiplications for the certain case. Finally, we have applied the BCJM to the time-invariant Gaussian MIMO channel. We have compared the channel of Toeplitz matrix and the low correlation block circulant Jacket matrix. The simulation has shown that the methods of the present disclosure can improve the channel capacity at the high SNR regime.

Although a few embodiments of the present disclosure have been shown and described, it would be appreciated by those skilled in the art that changes may be made in this embodiment without departing from the principles and spirit of the invention, the scope of which is defined in the claims and their equivalents. 

What is claimed is:
 1. A multi-input and multi-output (MIMO) communication method of a MIMO communication apparatus having receive antennas and a receive end, comprising: receiving, by the receive antennas of the MIMO apparatus, a transmit signal; and estimating, by the receive end of the MIMO apparatus, a channel using a receive signal received through the receive antennas, wherein the estimating estimates the channel using formula: $Y = {{\sqrt{\frac{E_{x}}{N_{T}}}H\; X} + Z}$ Y being the receive signal, E_(x) being an energy of the transmit signal, N_(T) being a number of transmit antennas, X being the transmit signal, Z being noise, and H being a channel matrix comprising a BCJM (Block Circulant Jacket Matrix) of order n (>4), wherein the H is expressed by formula: H=R _(r) ^(1/2) H _(w) R _(t) ^(1/2), R_(r) ^(1/2) being a matrix where correlation between transmit antennas are reflected, H_(w) being a channel gain matrix, and R_(t) ^(1/2) being a matrix where a correlation between receive antennas is reflected, wherein the R_(t) is expressed by the BCJM.
 2. The method according to claim 1, wherein the BCJM is [C]_(np) in $\lbrack C\rbrack_{np} = \begin{pmatrix} C_{0} & C_{1} & C_{2} & C_{3} & \ldots & C_{n - 2} & C_{n - 1} \\ C_{n - 1} & C_{0} & C_{1} & C_{2} & \ldots & C_{n - 3} & C_{n - 2} \\ \ldots & \ldots & \ldots & \ldots & \ddots & \ldots & \ldots \\ C_{1} & C_{2} & C_{3} & C_{4} & \ldots & C_{n - 1} & C_{0} \end{pmatrix}$ C₀, . . . , C_(n−1) being a p×p packet matrix.
 3. The method according to claim 1, wherein the BCJM is a block circulant jacket matrix [C]_(4p) of order 4p of $\lbrack C\rbrack_{4p} = \begin{pmatrix} C_{0} & C_{1} & C_{2} & C_{3} \\ C_{3} & C_{0} & C_{1} & C_{2} \\ C_{2} & C_{3} & C_{0} & C_{1} \\ C_{1} & C_{2} & C_{3} & C_{0} \end{pmatrix}$ C_(i)(i=0,1,2,3) being a p×p packet matrix.
 4. A multi-input and multi-output (MIMO) communication apparatus comprising: N_(R) receive antennas for receiving a transmit signal from a transmit end; and a receive end for estimating a channel using a receive signal received through the receive antennas, wherein the receive end estimates the channel using formula: $Y = {{\sqrt{\frac{E_{x}}{N_{T}}}H\; X} + Z}$ Y being the receive signal, E_(x) being an energy of the transmit signal, N_(T) being a number of transmit antennas, X being the transmit signal, Z being noise, and H being a channel matrix comprising a BCJM (Block Circulant Jacket Matrix) of order n (>4), wherein the H is expressed by formula: H=R _(r) ^(1/2) H _(w) R _(t) ^(1/2), R_(r) ^(1/2) being a matrix where correlation between transmit antennas are reflected, H_(w) being a channel gain matrix, and R_(t) ^(1/2) being a matrix where a correlation between receive antennas is reflected, wherein the R_(t) is expressed by the BCJM. 